Secure approximation of edit distance on genomic data

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Privacy-preserving Edit Distance on Genomic Data

Suppose Alice holds a DNA sequence and Bob owns a database of DNA sequences. They want to determine whether there is a match for the Alice’s input in the Bob’s database for any purpose such as diagnosis of Alice’s disease. However, Alice does not want to reveal her DNA pattern to Bob, since it would enable him to learn private information about her. For the similar reasons, Bob does not want to...

متن کامل

On Practical Accuracy of Edit Distance Approximation Algorithms

The edit distance is a basic string similarity measure used in many applications such as text mining, signal processing, bioinformatics, and so on. However, the computational cost can be a problem when we repeat many distance calculations as seen in real-life searching situations. A promising solution to cope with the problem is to approximate the edit distance by another distance with a lower ...

متن کامل

Secure Count Query on Encrypted Genomic Data

Human genomic information can yield more effective healthcare by guiding medical decisions. Therefore, genomics research is gaining popularity as it can identify potential correlations between a disease and a certain gene, which improves the safety and efficacy of drug treatment and can also develop more effective prevention strategies [1]. To reduce the sampling error and to increase the stati...

متن کامل

Map Edit Distance vs. Graph Edit Distance for Matching Images

Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...

متن کامل

On the computation of edit distance functions

The edit distance between two graphs on the same labeled vertex set is the symmetric difference of the edge sets. The edit distance function of hereditary property, H, is a function of p ∈ [0, 1] and is the limit of the maximum normalized distance between a graph of density p and H. This paper uses localization, for computing the edit distance function of various hereditary properties. For any ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMC Medical Genomics

سال: 2017

ISSN: 1755-8794

DOI: 10.1186/s12920-017-0279-9